Spectral Factorization and Nevanlinna - Pick Interpolation *
نویسنده
چکیده
We develop a spectral factorization algorithm based on linear fractional transformations and on the Nevanlinna-Pick interpolation theory. The algorithm is recursive and depends on a choice of points (Zk, k 1, 2, ") inside the unit disk. Under a mild condition on the distribution of the zk's, the convergence of the algorithm is established. The algorithm is flexible and convergence can be influenced by the selection of Zk' S.
منابع مشابه
Ela Spectral versus Classical Nevanlinna-pick Interpolation in Dimension Two∗
A genericity condition is removed from a result of Agler and Young which reduces the spectral Nevanlinna-Pick problem in two dimensions to a family of classical Nevanlinna-Pick problems. Unlike the original approach, the argument presented here does not involve state-space methods.
متن کاملSpectral versus classical Nevanlinna-Pick interpolation in dimension two
A genericity condition is removed from a result of Agler and Young which reduces the spectral Nevanlinna-Pick problem in two dimensions to a family of classical Nevanlinna-Pick problems. Unlike the original approach, the argument presented here does not involve state-space methods.
متن کاملNonisotropically Balanced Domains, Lempert Function Estimates, and the Spectral Nevanlinna-pick Problem
We introduce the notion of a Λ-nonisotropically balanced domain and show that the symmetrized polydisc in Cn, n ≥ 2, is an example of such a domain. Given a Λ-nonisotropically balanced domain Ω, we derive effective estimates from above and from below for the Lempert function κ̃Ω at (0, z) ∈ Ω × Ω. We use these estimates to derive certain conditions for realising a two-point Nevanlinna-Pick inter...
متن کاملNevanlinna-pick Interpolation and Factorization of Linear Functionals
If A is a unital weak-∗ closed subalgebra of a multiplier algebra on a reproducing kernel Hilbert space which has property A1(1), then the cyclic invariant subspaces provide an Nevanlinna-Pick (NP) family of kernels. This yields an NP interpolation theorem for a wide class of operator algebras. In particular, it applies to many kernel spaces over the unit disk including the Bergman space. We al...
متن کاملA Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices
The classical scalar Nevanlinna-Pick interpolation problem has a long and distinguished history, appearing in a variety of applications in mathematics and electrical engineering. There is a vast literature on this problem and on its various far reaching generalizations; for a quick historical survey see [1] and [38]. It is widely known that the now classical algorithm for solving this problem p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987